Unicyclic Graphs with the Fourth Extremal Wiener Indices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Wiener Index of Unicyclic Graphs

The Wiener index of a graph G is defined as W (G) = ∑ u,v dG(u, v), where dG(u, v) is the distance between u and v in G, and the sum goes over all pairs of vertices. In this paper, we characterize the connected unicyclic graph with minimum Wiener indices among all connected unicyclic graphs of order n and girth g with k pendent vertices.

متن کامل

The Polyphenyl Chains with Extremal Edge – Wiener Indices ∗

The edge-Wiener index of a connected graph is the sum of the distances between all pairs of edges of the graph. In this paper, we determine the polyphenyl chains with minimum and maximum edge-Wiener indices among all the polyphenyl chains with h hexagons. Moreover, explicit formulas for the edge-Wiener indices of extremal polyphenyl chains are obtained.

متن کامل

Computing Wiener and hyper–Wiener indices of unitary Cayley graphs

The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.

متن کامل

Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, we determined the extremal (maximal and minimal) unicyclic and bicyclic graphs with respect to Harary index. 2010 Mathematics Subject Classification: 05C90

متن کامل

Extremal unicyclic graphs with minimal distance spectral radius

The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m 6= 3). In this paper, we determine the extremal unicyclic graph which has minimal distance spectral radius in U (n,m) \ Cn.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Chemistry

سال: 2020

ISSN: 2090-9063,2090-9071

DOI: 10.1155/2020/2878901